Polygonal Designs: Existence and Construction

نویسندگان

  • John Hegeman
  • Jeff Langford
  • S. Y. Song
چکیده

Polygonal designs form a special class of partially balanced incomplete block designs. We resolve the existence problem for polygonal designs with various parameter sets and present several construction methods with blocks of small sizes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some existence and construction results of polygonal designs

This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods – some conventional and some new. We also establish a link between a class of ...

متن کامل

Cyclic Polygonal Designs with Block Size 3 and λ = 1 for Joint Distance α = 6 to 16

Stufken (1993) first introduced cyclic polygonal designs (CPDs) (in terms of cyclic balanced sampling plans excluding adjacent units (CBSAs)) for joint distance α ≥ 2. Wei (2002) first suggested the use of Langford sequence for the existence and construction of CPDs with block size k = 3 and λ = 1 for arbitrary α . Zhang and Chang (2005b) used Langford and extended Langford sequence, and constr...

متن کامل

Existence of resolvable H-designs with group sizes 2, 3, 4 and 6

In 1987, Hartman showed that the necessary condition v ≡ 4 or 8 (mod 12) for the existence of a resolvable SQS(v) is also sufficient for all values of v, with 23 possible exceptions. These last 23 undecided orders were removed by Ji and Zhu in 2005 by introducing the concept of resolvable H-designs. In this paper, we first develop a simple but powerful construction for resolvable H-designs, i.e...

متن کامل

On the existence of large sets of t-designs of prime sizes1

In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence...

متن کامل

Random dynamics and thermodynamic limits for polygonal Markov fields in the plane

We construct random dynamics on collections of non-intersecting planar contours, leaving invariant the distributions of lengthand area-interacting polygonal Markov fields with V-shaped nodes. The first of these dynamics is based on the dynamic construction of consistent polygonal fields, as presented in the original articles by Arak (1982) and Arak & Surgailis (1989, 1991), and it provides an e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004